Shortest Path Problem Under Trapezoidal Neutrosophic Information

نویسنده

  • Said Broumi
چکیده

In this study, we propose an approach to determine the shortest path length between a pair of specified nodes s and t on a network whose edge weights are represented by trapezoidal neutrosophic numbers. Finally, an illustrative example is provided to show the applicability and effectiveness of the proposed approach. Keywords—trapezoidal fuzzy neutrosophic sets; score function; Shortest path problem

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shortest Path Problem Under Triangular Fuzzy Number Neutrosophic Information

In this paper, we develop a new approach to deal with neutrosphic shortest path problem in a network in which each edge weight (or length) is represented as triangular fuzzy neutrosophic number. The proposed algorithm also gives the shortest path length from source node to destination node using ranking function. Finally, an illustrative example is also included to demonstrate our proposed appr...

متن کامل

Shortest Path Problem under Bipolar Neutrosphic Setting

This main purpose of this paper is to develop an algorithm to find the shortest path on a network in which the weights of the edges are represented by bipolar neutrosophic numbers. Finally, a numerical example has been provided for illustrating the proposed approach. Introduction Smarandache [1, 2] introduced neutrosophic set and neutrosophic logic by considering the nonstandard analysis. The c...

متن کامل

Computation of Shortest Path Problem in a Network with SV-Triangular Neutrosophic Numbers

In this article, we present an algorithm method for finding the shortest path length between a paired nodes on a network where the edge weights are characterized by single valued triangular neutrosophic numbers. The proposed algorithm gives the shortest path length from source node to destination node based on a ranking method. Finally, a numerical example is also presented to illustrate the ef...

متن کامل

Some Weighted Aggregation Operators of Trapezoidal Neutrosophic Numbers and Their Multiple Attribute Decision Making Method

This paper proposes the concepts of a neutrosophic number and a trapezoidal neutrosophic number (TNN), the basic operational relations of TNNs, and the score function of TNN. Then, we develop a trapezoidal neutrosophic weighted arithmetic averaging (TNWAA) operator and a trapezoidal neutrosophic weighted geometric averaging (TNWGA) operator to aggregate TNN information and investigate their pro...

متن کامل

Shortest Path Problem on Intuitionistic Fuzzy Network

Received 17September 2013; accepted 5 October2013 L Baba Abstract. Finding shortest paths in graphs has been the area of interest for many researchers. Shortest paths are one of the fundamental and most widely used concepts in networks. In this paper the authors present an algorithm to find an Intuitionistic Fuzzy Shortest Path (IFSP) in a directed graph in which the cost of every edges are rep...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016